Equidistant Binary Fingerprinting Codes Existence and Identification Algorithms
نویسندگان
چکیده
The fingerprinting technique consists in making the copies of a digital object unique by embedding a different set of marks in each copy. However, a coalition of dishonest users can create pirate copies that try to disguise their identities. We show how equidistant, binary codes that can be used as fingerprinting codes.
منابع مشابه
A New Class of Codes for Fingerprinting Schemes
In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be used as fingerprinting codes. Then we show that by giving algebraic structure to the equidistant code, the tracing process can be accomplished by passing a modified version of the Viterbi algorithm through the trellis representing...
متن کاملBinary Quasi Equidistant and Reflected Codes in Mixed Numeration Systems
The problem of constructing quasi equidistant and reflected binary Gray code sequences and code in a mixed factorial, Fibonacci and binomial numeration systems is considered in the article. Some combinatorial constructions and machine algorithms synthesis sequences, based on the method of directed enumeration are offered. For selected parameters of sequences all quasi equidistant (for individua...
متن کاملDigital fingerprinting codes: problem statements, constructions, identification of traitors
We consider a general fingerprinting problem of digital data under which coalitions of users can alter or erase some bits in their copies in order to create an illegal copy. Each user is assigned a fingerprint which is a word in a fingerprinting code of size (the total number of users) and length . We present binary fingerprinting codes secure against sizecoalitions which enable the distributor...
متن کاملDistributed Storage Systems based on Equidistant Subspace Codes
Distributed storage systems based on equidistant constant dimension codes are presented. These equidistant codes are based on the Plücker embedding, which is essential in the repair and the reconstruction algorithms. These systems posses several useful properties such as high failure resilience, minimum bandwidth, low storage, simple algebraic repair and reconstruction algorithms, good locality...
متن کاملStrongly separable codes
Binary t-frameproof codes (t-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly t-separable code (t-SSC) is introduced to improve such a scheme based on a binary t-FPC. A binary t-SSC has the same traceability as a binary t-FPC but has more codewords than a b...
متن کامل